A Statistically−based Switching Algorithm for ATM Network

Computer networking technologies support high−speed transmission of information and services for multimedia applications that include voice, video and data traffic in a single access path. One of these technologies is Asynchronous Transfer Mode (ATM), which is a switching technology for information processing over the network and is the choice of Integrated Services Digital Networks (B−ISDN). ATM is a cell−based switching technology that traditionally used static−priority switching algorithms. Static priority algorithms however result in starvation of low priority cells in the presence of higher priority ones. The use of dynamic priority algorithms resolved the starvation problem and improved end−to−end Quality of Service (QOS). However, dynamic priority algorithms require more hardware and execution time relative to static [1−6]. The proposed algorithm is dynamic and optimal as far as extra hardware requirement and additional running time are concerned. Computer simulation is used to demonstrate its superiority over some of the existing dynamic priority techniques.